Teachability of a Subclass of Simple Deterministic Languages
نویسنده
چکیده
We show a subclass of simple deterministic languages which is teachable in polynomial examples. Teachability on grammatical inference is studied with the setting called “identification in the limit from polynomial time and data”, and there are negative results for famous languages. In this paper, we show a learning algorithm from membership queries and counterexamples for a subclass of simple deterministic languages. The time complexity of this algorithm is bounded by a polynomial if we regard the cardinality of alphabet is constant. On the other hand, we can construct a teaching set for the subclass in polynomial time without the condition of constant.
منابع مشابه
A Note on the Emptiness of Intersection Problem for Left Szilard Languages
As left Szilard languages form a subclass of simple deterministic languages and even a subclass of super-deterministic languages, we know that their equivalence problem is decidable. In this note we show that their emptiness of intersection problem is undecidable. The proof follows the lines of the correponding proof for simple deterministic languages, but some technical tricks are needed. This...
متن کاملDeterministic Fuzzy Automaton on Subclasses of Fuzzy Regular ω-Languages
In formal language theory, we are mainly interested in the natural language computational aspects of ω-languages. Therefore in this respect it is convenient to consider fuzzy ω-languages. In this paper, we introduce two subclasses of fuzzy regular ω-languages called fuzzy n-local ω-languages and Buchi fuzzy n-local ω-languages, and give some closure properties for those subclasses. We define a ...
متن کاملEfficient minimization of deterministic weak ω-automata
We analyze the minimization problem for deterministic weak automata, a subclass of deterministic Büchi automata, which recognize the regular languages that are recognizable by deterministic Büchi and deterministic co-Büchi automata. We reduce the problem to the minimization of finite automata on finite words and obtain an algorithm running in time O(n · logn), where n is the number of states of...
متن کاملOn the Succintness of Different Representations of Languages
The purposes of this paper is to give simple new proofs of some interesting recent results about the relative succinctness of different representations of regular, deterministic and unambiguous context-free languages and to derive some new results about how the relative succinctness of representations change when the representations contain a formal proof that the languages generated are in the...
متن کاملA Formulation of Deterministic Bottom - UpParsing and Parser Generation In
This paper addresses eecient parsing in the context of logical inference for the purpose of using logic programming languages in compiler writing. A bottom-up, deterministic parsing mechanism is formulated for \bounded right context" grammars, a subclass of LR(k) grammars with characteristics amenable to declarative parser speciica-tion. A working parser generator for a logic programming langua...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IEICE Transactions
دوره 96-D شماره
صفحات -
تاریخ انتشار 2013